-
1 Fibonacci tree
дерево n ФибоначчиАнглийский-русский словарь по теории вероятностей, статистике и комбинаторике > Fibonacci tree
-
2 Fibonacci tree
Математика: дерево Фибоначчи -
3 Fibonacci tree
-
4 tree
1) вчт древовидная схема; древовидный дешифратор2) дерево (напр. графа) || древовидный3) крист. дендрит•- tree of given weight
- tree of objectives
- tree of statements
- abstract syntax tree
- adaptive tree
- Adel'son-Vel'ski-Landis tree
- Aronshine tree
- AVL tree
- B-tree
- balanced tree
- bifurcation tree
- binary tree
- binary searchtree
- Boolean tree
- branching tree
- Cartesian tree
- Cayley tree
- choice tree
- classification tree
- classification and regression tree
- clock tree
- cluster tree
- co-tree
- code tree
- command tree
- complement tree
- complete code tree
- computation tree
- conference tree
- countable tree
- decision tree
- decomposition tree
- deduction tree
- derivation tree
- edge-rooted tree
- equipotential tree
- existence trie tree
- fault tree
- Feigenbaum tree
- Fibonacci tree
- finite tree
- fractal tree
- game tree
- generation tree
- graph tree
- hardware tree
- hierarchical tree
- homeomorphically irreducible tree
- Husimi tree
- hypothesis search tree
- inference tree
- information tree
- labeled tree
- language tree
- lexicographic tree
- loaded fractal tree
- logical tree
- minimal tree
- minimal length tree
- multibranch tree
- multiway tree
- normal tree
- optimal tree
- optimal merge tree
- optimal search tree
- ordered tree
- oriented tree
- outcome tree
- parse tree
- parsing tree
- patricia tree
- planar tree
- plane tree
- priority tree
- priority search tree
- probability tree
- production tree
- proper tree
- proof tree
- radix tree
- randomized binary tree
- RB tree
- recursive tree
- red-black tree
- response tree
- rooted tree
- search tree
- selection tree
- shortest tree
- shortest-distance tree
- signed tree
- spanning tree
- specific tree
- subject tree
- subspanning tree
- suffix tree
- symmetric tree
- syntax tree
- ternary tree
- ternary search tree
- threaded tree
- topological tree
- transition tree
- trie tree
- two-color tree
- two-dimensional tree
- two-level tree
- unlabeled tree
- weighted tree -
5 tree
nounдерево narc-disjoint trees деревья pl без общих дугroot of a random tree корень m случайного дереваtree -cograph дерево-кограф mtree-type constraint ограничение n типа дереваАнглийский-русский словарь по теории вероятностей, статистике и комбинаторике > tree
-
6 search
1) поиск || искать; осуществлять поиск || поисковый3) исследование; изучение || исследовать; изучать•- search in state space
- admissible search
- area search
- automated search
- automatic search
- automatic program search
- backtracking search
- beam search
- best-first search
- binary search
- bisection search
- blind search
- Boolean search
- branch-and-bound search - brute force search
- case-insensitive search
- case-sensitive search
- catalog search
- chaining search
- chapter search
- Charalambous' search
- conjunctive search
- content-addressable search
- contextual search
- database search
- depth-first search
- dichotomizing search
- directory search
- disjunctive search
- exhaustive search of memory
- eyeball search
- fast search
- Fibonacci search
- Fibonacci numbers search
- file search
- fixed-format search
- folder search
- frequency-agile search
- geometrical search
- golden section search
- graph search
- hash search
- heuristic search
- holographic information search
- hybrid bisection-cubic search
- indexed search
- key search
- keyword search
- limit-type search
- linear search
- logarithmic search
- multiple-string search
- optimum tree search
- ordered search
- parallel search
- patent search
- pattern matching search
- proximity search
- quadratic quotient search
- quantum search
- radar search
- random search
- reconnaissance search
- self-terminating search
- semantic search
- sequential search
- sequential tree search
- serial search
- skip search
- stepped search
- straightforward search
- tree search
- variable search by value
- weighted search
- word search -
7 search
1) поиск || искать; осуществлять поиск || поисковый2) вчт. команда или программа поиска3) исследование; изучение || исследовать; изучать•- area search
- automated search
- automatic program search
- automatic search
- backtracking search
- beam search
- best-first search
- binary search
- bisection search
- blind search
- Boolean search
- branch-and-bound search
- breadth-first search
- Brent's search
- brute force search
- case-insensitive search
- case-sensitive search
- catalog search
- chaining search
- chapter search
- Charalambous' search
- conjunctive search
- content-addressable search
- contextual search
- database search
- depth-first search
- dichotomizing search
- directory search
- disjunctive search
- exhaustive search of memory
- eyeball search
- fast search
- Fibonacci numbers search
- Fibonacci search
- file search
- fixed-format search
- folder search
- frequency-agile search
- geometrical search
- golden section search
- graph search
- hash search
- heuristic search
- holographic information search
- hybrid bisection-cubic search
- indexed search
- key search
- keyword search
- limit-type search
- linear search
- logarithmic search
- multiple-string search
- optimum tree search
- ordered search
- parallel search
- patent search
- pattern matching search
- proximity search
- quadratic quotient search
- quantum search
- radar search
- random search
- reconnaissance search
- search for extraterrestrial intelligence
- search in problem space
- search in state space
- self-terminating search
- semantic search
- sequential search
- sequential tree search
- serial search
- skip search
- stepped search
- straightforward search
- tree search
- variable search by value
- weighted search
- word searchThe New English-Russian Dictionary of Radio-electronics > search
-
8 search
1) поиск || искать, проводить поиск2) перебор (напр. вариантов) || перебирать (напр. варианты)•-
air conflict search
-
air search
-
area search
-
associative search
-
automatic datum search
-
beam search
-
bidirectional search
-
binary search
-
branch-and-bound search
-
chaining search
-
chain search
-
conjunctive search
-
contents search
-
dichotomizing search
-
dictionary search
-
disjunction search
-
exhaustive search
-
Fibonacci search
-
frequency search
-
frequency-agile search
-
guided search
-
heuristic search
-
key search
-
limit-type search
-
linear search
-
literature search
-
look-ahead search
-
multiaspect search
-
mutual search
-
ordered search
-
radar search
-
radio search
-
random search
-
sequential tree search
-
shuttle search
-
spiral search
-
square search
-
stepped search
-
target search
-
tree search
-
trial-and-error search
-
volumetric search
См. также в других словарях:
Fibonacci heap — In computer science, a Fibonacci heap is a heap data structure consisting of a forest of trees. It has a better amortized running time than a binomial heap. Fibonacci heaps were developed by Michael L. Fredman and Robert E. Tarjan in 1984 and… … Wikipedia
Fibonacci number — A tiling with squares whose sides are successive Fibonacci numbers in length … Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
Spanning Tree — Ein Graph mit einem minimalen Spannbaum. Ein Spannbaum (auch aufspannender Baum oder manchmal spannender Baum genannt; englisch spanning tree) ist in der Graphentheorie ein Teilgraph eines ungerichteten Graphen, der ein Baum ist und alle Knoten… … Deutsch Wikipedia
Suffix tree — In computer science, a suffix tree (also called suffix trie, PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many… … Wikipedia
Binary Tree — Ein voller, aber nicht vollständiger Binärbaum Als Binärbaum bezeichnet man in der Graphentheorie eine spezielle Form eines Graphen. Genauer gesagt handelt es sich um einen gewurzelten Baum, bei dem jeder Knoten höchstens zwei Kindknoten besitzt … Deutsch Wikipedia
Context tree weighting — The context tree weighting method (CTW) is a lossless compression and prediction algorithm by Willems, Shtarkov, and Tjalkens (1995) . The CTW algorithm is among the very few such algorithms that offer both theoretical guarantees and good… … Wikipedia
AVL tree — Arbre AVL Pour les articles homonymes, voir AVL. Un exemple d arbre non AVL. En informatique, les arbres AVL ont été his … Wikipédia en Français
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия